A COMBINATORIAL APPROACH TO POLYGON SIMILARITYAVIS D; ELGINDY H.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 148-150; BIBL. 15 REF.Article

LOWER BOUNDS OF THE COMPLEXITY OF LINEAR ALGEBRASBINI D; CAPOVANI M.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 46-47; BIBL. 3 REF.Article

PARTITION OPTIMALE D'UN ENSEMBLE FINI EN SOUS-ENSEMBLESTANAEV VS.1979; DOKL. AKAD. NAUK B.S.S.R.; BYS; DA. 1979; VOL. 23; NO 1; PP. 26-28; ABS. ENG; BIBL. 4 REF.Article

A NOTE ON LOCATING A SET OF POINTS IN A PLANAR SUBDIVISIONPREPARATA FP.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 542-545; BIBL. 4 REF.Article

AN ANALYSIS OF GENERALIZATION AS A SEARCH PROBLEMMITCHELL TM.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 577-582; BIBL. 13 REF.Conference Paper

ALGEBRAS HAVING LINEAR MULTIPLICATIVE COMPLEXITIES.FIDUCCIA CM; ZALCSTEIN Y.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 2; PP. 311-331; BIBL. 28 REF.Article

DYNAMIZATION OF DECOMPOSABLE SEARCHING PROBLEMSVAN LEEUWEN J; WOOD D.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 51-56; BIBL. 6 REF.Article

NEGATION CAN BE EXPONENTIALLY POWERFULVALIANT LG.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 303-314; BIBL. 23 REF.Article

THE COMPUTATIONAL COMPLEXITY OF MATROID PROPERTIESROBINSON GC; WELSH DJA.1980; MATH. PROC. CAMBRIDGE PHILOS. SOC.; GBR; DA. 1980; VOL. 87; NO 1; PP. 29-45; BIBL. 17 REF.Article

PACKINGS OF GRAPHS AND APPLICATIONS TO COMPUTATIONAL COMPLEXITYBOLLOBAS B; ELDRIDGE SE.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 2; PP. 105-124; BIBL. 9 REF.Article

COMPUTATIONAL LENGTH IN PATTERN RECOGNIZERSVISCOLANI B.1982; PATTERN RECOGNITION; ISSN 0031-3203; USA; DA. 1982; VOL. 15; NO 5; PP. 413-418; BIBL. 6 REF.Article

THE COMPUTATIONAL COMPLEXITY OF A SET OF QUADRATIC FUNCTIONSJA'JA' J.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 209-223; BIBL. 13 REF.Article

A FAST ALGORITHM FOR NONPARAMETRIC PROBABILITY DENSITY ESTIMATIONPOSTAIRE JG; VASSEUR C.1982; IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 6; PP. 663-666; BIBL. 9 REF.Article

PROVABLY DIFFICULT COMBINATORIAL GAMESSTOCKMEYER LJ; CHANDRA AK.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 151-174; BIBL. 24 REF.Article

A NOTE ON THE COMPLEXITY OF ALGEBRAIC DIFFERENTIATION.CAVINESS BF; EPSTEIN HI.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 2; PP. 122-124; BIBL. 6 REF.Article

ON GENERALIZED COMPUTATIONAL COMPLEXITY.JACOBS BE.1977; J. SYMBOL. LOGIC; U.S.A.; DA. 1977; VOL. 42; NO 1; PP. 47-58; BIBL. 23 REF.Article

THE COMPUTATIONAL COMPLEXITY OF CONTINUED FRACTIONSSTRASSEN V.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 1; PP. 1-27; BIBL. 27 REF.Article

RAPID MULTIPLICATION OF RECTANGULAR MATRICESCOPPERSMITH D.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 467-471; BIBL. 4 REF.Article

ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATIONCOPPERSMITH D; WINOGRAD S.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 82-90; BIBL. 12 REF.Conference Paper

ON THE NUMBER OF P-ISOMORPHISM CLASSES OF NP-COMPLETE SETSMAHANEY SR.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 271-278; BIBL. 9 REF.Conference Paper

COMPLEXITY BOUNDS FOR EQUIVALENCE AND ISOMORPHISM OF LATIN SQUAREBOHM C; MACHI A; SONTACCHI G et al.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 231-233; BIBL. 2 REF.Article

GO IS POLYNOMIAL-SPACE HARDLICHTENSTEIN D; SIPSER M.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 2; PP. 393-401; BIBL. 10 REF.Article

A-CALCULS DE TURING ET COMPLEXITE ESSENTIELLE DES A-INVERSIONS DE MOTS BINAIRESMOSHCHENSKIJ VA.1980; METODY DISKRETN. ANAL.; SUN; DA. 1980; NO 35; PP. 83-92; BIBL. 3 REF.Article

COMPLEXITES POLYNOMIALES DE LA DEDUCTION DES CALCULS LOGIQUESDARDZHANIYA GK.1979; VEST. MOSKOV. UNIV., 1; SUN; DA. 1979; NO 3; PP. 10-18; ABS. ENG; BIBL. 3 REF.Article

A NOTE ON PATHS EMBEDDED IN TREESROSENBERG AL.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 5; PP. 272-273; BIBL. 3 REF.Article